Parameterized Algorithms for the 2-Clustering Problem with Minimum Sum and Minimum Sum of Squares Objective Functions
نویسندگان
چکیده
منابع مشابه
An Incremental DC Algorithm for the Minimum Sum-of-Squares Clustering
Here, an algorithm is presented for solving the minimum sum-of-squares clustering problems using their difference of convex representations. The proposed algorithm is based on an incremental approach and applies the well known DC algorithm at each iteration. The proposed algorithm is tested and compared with other clustering algorithms using large real world data sets.
متن کاملOn the Complexity of Minimum Sum-of-Squares Clustering
To the best of our knowledge, the complexity of minimum sum-of-squares clustering is unknown. Yet, it has often been stated that this problem is NP-hard. We examine causes for such confusion and in the process show that a recent proof of Drineas et al. in Machine Learning 56, 9–33, 2004 is not valid and unlikely to be salvaged.
متن کاملConstrained Minimum Sum of Squares Clustering by Constraint Programming
The Within-Cluster Sum of Squares (WCSS) is the most used criterion in cluster analysis. Optimizing this criterion is proved to be NP-Hard and has been studied by different communities. On the other hand, Constrained Clustering allowing to integrate previous user knowledge in the clustering process has received much attention this last decade. As far as we know, there is a single approach that ...
متن کاملDesign of hybrids for the minimum sum-of-squares clustering problem
A series of metaheuristic algorithms is proposed and analyzed for the non-hierarchical clustering problem under the criterion of minimum Sum-of-Squares Clustering. These algorithms incorporate genetic operators and Local Search and Tabu Search procedures. The aim is to obtain quality solutions with short computation times. A series of computational experiments has been performed. The proposed a...
متن کاملA scatter search approach for the minimum sum-of-squares clustering problem
A metaheuristic procedure based on the Scatter Search approach is proposed for the non-hierarchical clustering problem under the criterion of minimum Sum-of-Squares Clustering. This algorithm incorporates procedures based on different strategies, such as Local Search, GRASP, Tabu Search or Path Relinking. The aim is to obtain quality solutions with short computation times. A series of computati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2014
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-014-9874-8